Federated Scheduling Optimization Scheme for Typed Tasks with Power Constraints in Heterogeneous Multicore Processor Architectures

In heterogeneous multicore processor architectures, it is a critical concern to optimize the performance of typed tasks (real-time and non-real-time tasks) under limited power consumption. this paper, we propose power-constrained federated scheduling optimization scheme for based on both global local systems. The system adopts strategy split task stream into multiple real-time sub-streams. systems are constructed as set M/M/c/m queueing with processors considering priority finite capacity, avoiding blocking resource wastage through cache parallel execution two types sub-flows. To meet deadline constraints tasks, model strong preemption constructed, stable efficient algorithm sequential quadratic programming block homotopy proposed, which can ensure optimal distribution while maintaining load balancing schedulability. For dichotomous search-based minimize average response time providing theoretical analysis proof speed configurations multiprocessor constraints. Simulation results demonstrate that factors such size, available power, arrival rate have significant impact performance, proposed enables in